Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
نویسندگان
چکیده
منابع مشابه
Flowshop scheduling with identical jobs and uniform parallel machines
The single-stage scheduling problem to minimize the makespan of identical jobs on uniform parallel machines is known to be solvable in polynomial-time. We extend this work to consider multi-stage systems with flowshop configuration. We show that the 2-stage problem may also be solved in polynomial-time and for the number of stages greater than two, the problem is shown to be NP-hard. We present...
متن کاملSingle-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs L-H Sun1,2,3, L-Y Sun3,4,5 and J-B Wang2,6∗ 1School of Business Administration, Xi’an University of Technology, Xi’an, People’s Republic of China; 2Knowledge Management & Innovation Research Centre, Xi’an Jiaotong University, Xi’an, People’s Republic of China; 3The State Key Laboratory on M...
متن کاملOnline Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines
Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. Examples include scheduling cleaning or maintenance, fire fighting, steel production and financial management. Scheduling of deteriorating jobs was first introduced on a single machine by Browne and Yechiali, ...
متن کاملOnline scheduling of two type parallel jobs on identical machines
In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using " temporary schedule " .
متن کاملScheduling equal-length jobs on identical parallel machines
We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions fi of the completion time Ci of each job Ji, the problem can be solved in polynomial time for any fixed value of m. The only restriction is that functions fi have to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2011
ISSN: 0307-904X
DOI: 10.1016/j.apm.2010.09.013